21,544 research outputs found

    Preaching the presence of God: a homiletic from an Asian American perspective

    Get PDF
    Kim, Eunjoo Mary. Preaching the presence of God: a homiletic from an Asian American perspective. Valley Forge: Judson Press, 1999

    Sarah Turner - eco-artist and designer through craft-based upcycling

    Get PDF
    Sarah Turner is an eco-artist and designer who practices craft-based upcycling with waste plastic bottles and cans to create lighting, sculpture and decorative home interior products. Since 1998, her enthusiasm, creativity and good will have allowed her to gain several high-profile client commissions and to win awards from design, innovation and business competitions. The aim of this portrait is to introduce Sarah’s work and shed light on the resources, knowledge and skills involved in her practice and on the barriers to and drivers for her craft-based upcycling. We consider that Sarah’s work could be one of the stepping stones for a shift towards more sustainable craft practice, both in the United Kingdom and beyond. By exploring the right ingredients for craft-based upcycling, barriers liable to be faced and key drivers that stimulate motivation, we hope that this portrait will inspire and attract more designers and makers to embed upcycling in their future practice

    Modularizing and Specifying Protocols among Threads

    Full text link
    We identify three problems with current techniques for implementing protocols among threads, which complicate and impair the scalability of multicore software development: implementing synchronization, implementing coordination, and modularizing protocols. To mend these deficiencies, we argue for the use of domain-specific languages (DSL) based on existing models of concurrency. To demonstrate the feasibility of this proposal, we explain how to use the model of concurrency Reo as a high-level protocol DSL, which offers appropriate abstractions and a natural separation of protocols and computations. We describe a Reo-to-Java compiler and illustrate its use through examples.Comment: In Proceedings PLACES 2012, arXiv:1302.579

    Toward Sequentializing Overparallelized Protocol Code

    Full text link
    In our ongoing work, we use constraint automata to compile protocol specifications expressed as Reo connectors into efficient executable code, e.g., in C. We have by now studied this automata based compilation approach rather well, and have devised effective solutions to some of its problems. Because our approach is based on constraint automata, the approach, its problems, and our solutions are in fact useful and relevant well beyond the specific case of compiling Reo. In this short paper, we identify and analyze two such rather unexpected problems.Comment: In Proceedings ICE 2014, arXiv:1410.701

    Data optimizations for constraint automata

    Get PDF
    Constraint automata (CA) constitute a coordination model based on finite automata on infinite words. Originally introduced for modeling of coordinators, an interesting new application of CAs is implementing coordinators (i.e., compiling CAs into executable code). Such an approach guarantees correctness-by-construction and can even yield code that outperforms hand-crafted code. The extent to which these two potential advantages materialize depends on the smartness of CA-compilers and the existence of proofs of their correctness. Every transition in a CA is labeled by a "data constraint" that specifies an atomic data-flow between coordinated processes as a first-order formula. At run-time, compiler-generated code must handle data constraints as efficiently as possible. In this paper, we present, and prove the correctness of two optimization techniques for CA-compilers related to handling of data constraints: a reduction to eliminate redundant variables and a translation from (declarative) data constraints to (imperative) data commands expressed in a small sequential language. Through experiments, we show that these optimization techniques can have a positive impact on performance of generated executable code

    Revival of the Thermal Sneutrino Dark Matter

    Get PDF
    The left-handed sneutrino in the Minimal Supersymmetric Standard Model (MSSM) has been ruled out as a viable thermal dark matter candidate, due to conflicting constraints from direct detection experiments and from the measurement of the dark matter relic density. The intrinsic fine-tuning problem of the MSSM, however, motivates an extension with a new U(1)' gauge symmetry. We show that in the U(1)'-extended MSSM the right-handed sneutrino becomes a good thermal dark matter candidate. We identify two generic parameter space regions where the combined constraints from relic density determinations, direct detection and collider searches are all satisfied.Comment: 5 pages, 3 figures. Version to appear in Phys. Rev.
    • …
    corecore